منابع مشابه
subgroup intersection graph of finite abelian groups
let $g$ be a finite group with the identity $e$. the subgroup intersection graph $gamma_{si}(g)$ of $g$ is the graph with vertex set $v(gamma_{si}(g)) = g-e$ and two distinct vertices $x$ and $y$ are adjacent in $gamma_{si}(g)$ if and only if $|leftlangle xrightrangle capleftlangle yrightrangle|>1$, where $leftlangle xrightrangle $ is the cyclic subgroup of $g$ generated by $xin g$. in th...
متن کاملThe stable set problem and the thinness of a graph
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a certain representation is given for a graph. The algorithm generalizes the algorithm for interval graphs and that for graphs with bounded pathwidth. By a suitable application to the frequency assignment problem, we find better solutions for almost all the instances of a relevant test-bed.
متن کاملPlanar Graph Characterization - Using γ - Stable Graphs
A graph G is said to be γ stable if γ(Gxy) = γ(G), for all x, y ∈ V (G), x is not adjacent to y, where Gxy denotes the graph obtained by merging the vertices x, y. In this paper we have provided a necessary and sufficient condition for Ḡ to be γ stable, where Ḡ denotes the complement of G. We have obtained a characterization of planar graphs when G and Ḡ are γ stable graphs. Key–Words: γ stable...
متن کاملStable Incremental Layouts for Dynamic Graph Visualizations
In this paper we present a set of extension techniques to stabilize interactive dynamic graph layout algorithms. It works with different existing Focus & Context methods. We first deal with the initial placement of newly inserted nodes to mitigate acting forces in the layout algorithm. Then, their influence on the existing layout is gradually increased to create a smooth transition between the ...
متن کاملAnti-coordination Games and Stable Graph Colorings
Motivated by understanding non-strict and strict pure strategy equilibria in network anti-coordination games, we define notions of stable and, respectively, strictly stable colorings in graphs. We characterize the cases when such colorings exist and when the decision problem is NP-hard. These correspond to finding pure strategy equilibria in the anti-coordination games, whose price of anarchy w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática
سال: 2018
ISSN: 2175-1188,0037-8712
DOI: 10.5269/bspm.v36i3.31678